package com.felix.algorithms.planning;

/**
 * ClimbingStairs
 *
 * @author xuejinhua
 * @date 2018/9/12 14:32
 */
public class ClimbingStairs {

    /**
     * Q70
     *
     * @return
     */
    public static int solution(int n) {
        if (n <= 2) {
            return n;
        }
        int[] dp = new int[n + 1];
        dp[0] = 0;
        dp[1] = 1;
        dp[2] = 2;
        for (int i = 3; i < n + 1; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }
        return dp[n];
    }

    public static void main(String[] args) {
        System.out.println(solution(10));
    }
}
